0.06/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.06/0.12	% Command    : run_E %s %d THM
0.12/0.34	% Computer : n014.cluster.edu
0.12/0.34	% Model    : x86_64 x86_64
0.12/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory   : 8042.1875MB
0.12/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 960
0.12/0.34	% WCLimit    : 120
0.12/0.34	% DateTime   : Tue Aug  9 03:18:01 EDT 2022
0.12/0.34	% CPUTime    : 
0.19/0.47	Running higher-order on 8 cores theorem proving
0.19/0.47	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.19/0.47	# Version: 3.0pre003-ho
0.19/0.48	# Preprocessing class: HSSSSMSSSSSNSSA.
0.19/0.48	# Scheduled 8 strats onto 8 cores with 120 seconds (960 total)
0.19/0.48	# Starting post_as_ho12 with 120s (1) cores
0.19/0.48	# Starting new_bool_9 with 120s (1) cores
0.19/0.48	# Starting post_as_ho1 with 120s (1) cores
0.19/0.48	# Starting post_as_ho4 with 120s (1) cores
0.19/0.48	# Starting post_as_ho2 with 120s (1) cores
0.19/0.48	# Starting ehoh_best2_full_lfho with 120s (1) cores
0.19/0.48	# Starting full_lambda_10 with 120s (1) cores
0.19/0.48	# Starting new_ho_8 with 120s (1) cores
0.19/0.48	# post_as_ho12 with pid 10274 completed with status 0
0.19/0.48	# Result found by post_as_ho12
0.19/0.48	# Preprocessing class: HSSSSMSSSSSNSSA.
0.19/0.48	# Scheduled 8 strats onto 8 cores with 120 seconds (960 total)
0.19/0.48	# Starting post_as_ho12 with 120s (1) cores
0.19/0.48	# No SInE strategy applied
0.19/0.48	# Search class: HGHSF-FFSF11-SSSFFMBN
0.19/0.48	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.19/0.48	# Starting ho_unfolding_6 with 65s (1) cores
0.19/0.48	# ho_unfolding_6 with pid 10283 completed with status 0
0.19/0.48	# Result found by ho_unfolding_6
0.19/0.48	# Preprocessing class: HSSSSMSSSSSNSSA.
0.19/0.48	# Scheduled 8 strats onto 8 cores with 120 seconds (960 total)
0.19/0.48	# Starting post_as_ho12 with 120s (1) cores
0.19/0.48	# No SInE strategy applied
0.19/0.48	# Search class: HGHSF-FFSF11-SSSFFMBN
0.19/0.48	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.19/0.48	# Starting ho_unfolding_6 with 65s (1) cores
0.19/0.48	# Preprocessing time       : 0.001 s
0.19/0.48	
0.19/0.48	# Proof found!
0.19/0.48	# SZS status Theorem
0.19/0.48	# SZS output start CNFRefutation
0.19/0.48	thf(decl_22, type, cJ: $i).
0.19/0.48	thf(decl_23, type, cLIKE: $i > $i > $o).
0.19/0.48	thf(decl_24, type, cUNIQUE: $i > $o).
0.19/0.48	thf(decl_25, type, cS: $i).
0.19/0.48	thf(decl_26, type, cP: $i).
0.19/0.48	thf(decl_27, type, esk1_1: ($i > $o) > $i).
0.19/0.48	thf(cLING2, conjecture, (?[X1:$i > $o]:((((X1 @ cP)<=>(cLIKE @ cP @ cS))&((X1 @ cJ)<=>?[X2:$i]:(((cLIKE @ cJ @ X2)&(cUNIQUE @ X2))))))<=((cUNIQUE @ cS)&![X2:$i]:((![X3:$i]:(((X2)=(X3)))<=(cUNIQUE @ X2))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cLING2)).
0.19/0.48	thf(c_0_1, negated_conjecture, ~((((cUNIQUE @ cS)&![X2:$i]:(((cUNIQUE @ X2)=>![X3:$i]:(((X2)=(X3))))))=>?[X1:$i > $o]:((((X1 @ cP)<=>(cLIKE @ cP @ cS))&((X1 @ cJ)<=>?[X2:$i]:(((cLIKE @ cJ @ X2)&(cUNIQUE @ X2)))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cLING2])])).
0.19/0.48	thf(c_0_2, negated_conjecture, ![X8:$i, X9:$i, X10:$i > $o, X11:$i]:((((cUNIQUE @ cS)&(~(cUNIQUE @ X8)|((X8)=(X9))))&(((~(X10 @ cJ)|(~(cLIKE @ cJ @ X11)|~(cUNIQUE @ X11))|(~(X10 @ cP)|~(cLIKE @ cP @ cS)))&(((cLIKE @ cJ @ (esk1_1 @ X10))|(X10 @ cJ)|(~(X10 @ cP)|~(cLIKE @ cP @ cS)))&((cUNIQUE @ (esk1_1 @ X10))|(X10 @ cJ)|(~(X10 @ cP)|~(cLIKE @ cP @ cS)))))&((~(X10 @ cJ)|(~(cLIKE @ cJ @ X11)|~(cUNIQUE @ X11))|((X10 @ cP)|(cLIKE @ cP @ cS)))&(((cLIKE @ cJ @ (esk1_1 @ X10))|(X10 @ cJ)|((X10 @ cP)|(cLIKE @ cP @ cS)))&((cUNIQUE @ (esk1_1 @ X10))|(X10 @ cJ)|((X10 @ cP)|(cLIKE @ cP @ cS)))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])).
0.19/0.48	thf(c_0_3, negated_conjecture, ![X2:$i, X1:$i > $o]:((~((X1 @ cJ))|~((cLIKE @ cJ @ X2))|~((cUNIQUE @ X2))|~((X1 @ cP))|~((cLIKE @ cP @ cS)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.19/0.48	thf(c_0_4, negated_conjecture, ![X3:$i, X2:$i]:((((X2)=(X3))|~((cUNIQUE @ X2)))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.19/0.48	thf(c_0_5, negated_conjecture, (cUNIQUE @ cS), inference(split_conjunct,[status(thm)],[c_0_2])).
0.19/0.48	thf(c_0_6, negated_conjecture, ![X3:$i, X2:$i, X1:$i > $o]:((~((cLIKE @ cP @ X2))|~((cLIKE @ cJ @ X3))|~((cUNIQUE @ X3))|~((X1 @ cJ))|~((X1 @ cP)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3, c_0_4]), c_0_5])])).
0.19/0.48	thf(c_0_7, negated_conjecture, ![X2:$i, X1:$i > $o]:((~((cLIKE @ cJ @ X2))|~((cUNIQUE @ cP))|~((cUNIQUE @ X2))|~((X1 @ cJ)))), inference(condense,[status(thm)],[inference(spm,[status(thm)],[c_0_6, c_0_4])])).
0.19/0.48	thf(c_0_8, negated_conjecture, ![X2:$i]:((cUNIQUE @ X2)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5, c_0_4]), c_0_5])])).
0.19/0.48	thf(c_0_9, negated_conjecture, ![X2:$i, X1:$i > $o]:((~((cLIKE @ cJ @ X2))|~((X1 @ cJ)))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_7, c_0_8]), c_0_8])])).
0.19/0.48	thf(c_0_10, negated_conjecture, ![X2:$i, X3:$i]:(((X2)=(X3))), inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_4, c_0_8])])).
0.19/0.48	thf(c_0_11, negated_conjecture, ![X1:$i > $o, X3:$i, X2:$i]:((~((cLIKE @ X2 @ X3))|~((X1 @ X2)))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
0.19/0.48	thf(c_0_12, negated_conjecture, ![X1:$i > $o]:(((cLIKE @ cJ @ (esk1_1 @ X1))|(X1 @ cJ)|(X1 @ cP)|(cLIKE @ cP @ cS))), inference(split_conjunct,[status(thm)],[c_0_2])).
0.19/0.48	thf(c_0_13, negated_conjecture, ![X1:$i > $o, X4:$i > $o]:(((cLIKE @ cP @ cS)|(X1 @ cJ)|(X1 @ cP)|~((X4 @ cJ)))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
0.19/0.48	thf(c_0_14, negated_conjecture, ![X1:$i > $o]:(((cLIKE @ cP @ cS)|(X1 @ cP)|(X1 @ cJ))), inference(spm,[status(thm)],[c_0_13, c_0_8])).
0.19/0.48	thf(c_0_15, negated_conjecture, ($false), inference(flex_resolve,[status(thm)],[inference(spm,[status(thm)],[c_0_11, c_0_14])]), ['proof']).
0.19/0.48	# SZS output end CNFRefutation
0.19/0.48	# Parsed axioms                        : 6
0.19/0.48	# Removed by relevancy pruning/SinE    : 0
0.19/0.48	# Initial clauses                      : 13
0.19/0.48	# Removed in clause preprocessing      : 5
0.19/0.48	# Initial clauses in saturation        : 8
0.19/0.48	# Processed clauses                    : 24
0.19/0.48	# ...of these trivial                  : 2
0.19/0.48	# ...subsumed                          : 4
0.19/0.48	# ...remaining for further processing  : 17
0.19/0.48	# Other redundant clauses eliminated   : 0
0.19/0.48	# Clauses deleted for lack of memory   : 0
0.19/0.48	# Backward-subsumed                    : 6
0.19/0.48	# Backward-rewritten                   : 7
0.19/0.48	# Generated clauses                    : 68
0.19/0.48	# ...of the previous two non-redundant : 71
0.19/0.48	# ...aggressively subsumed             : 0
0.19/0.48	# Contextual simplify-reflections      : 0
0.19/0.48	# Paramodulations                      : 62
0.19/0.48	# Factorizations                       : 0
0.19/0.48	# NegExts                              : 0
0.19/0.48	# Equation resolutions                 : 0
0.19/0.48	# Propositional unsat checks           : 0
0.19/0.48	#    Propositional check models        : 0
0.19/0.48	#    Propositional check unsatisfiable : 0
0.19/0.48	#    Propositional clauses             : 0
0.19/0.48	#    Propositional clauses after purity: 0
0.19/0.48	#    Propositional unsat core size     : 0
0.19/0.48	#    Propositional preprocessing time  : 0.000
0.19/0.48	#    Propositional encoding time       : 0.000
0.19/0.48	#    Propositional solver time         : 0.000
0.19/0.48	#    Success case prop preproc time    : 0.000
0.19/0.48	#    Success case prop encoding time   : 0.000
0.19/0.48	#    Success case prop solver time     : 0.000
0.19/0.48	# Current number of processed clauses  : 4
0.19/0.48	#    Positive orientable unit clauses  : 1
0.19/0.48	#    Positive unorientable unit clauses: 1
0.19/0.48	#    Negative unit clauses             : 0
0.19/0.48	#    Non-unit-clauses                  : 2
0.19/0.48	# Current number of unprocessed clauses: 50
0.19/0.48	# ...number of literals in the above   : 209
0.19/0.48	# Current number of archived formulas  : 0
0.19/0.48	# Current number of archived clauses   : 13
0.19/0.48	# Clause-clause subsumption calls (NU) : 55
0.19/0.48	# Rec. Clause-clause subsumption calls : 13
0.19/0.48	# Non-unit clause-clause subsumptions  : 11
0.19/0.48	# Unit Clause-clause subsumption calls : 6
0.19/0.48	# Rewrite failures with RHS unbound    : 28
0.19/0.48	# BW rewrite match attempts            : 27
0.19/0.48	# BW rewrite match successes           : 13
0.19/0.48	# Condensation attempts                : 24
0.19/0.48	# Condensation successes               : 2
0.19/0.48	# Termbank termtop insertions          : 3725
0.19/0.48	
0.19/0.48	# -------------------------------------------------
0.19/0.48	# User time                : 0.005 s
0.19/0.48	# System time              : 0.003 s
0.19/0.48	# Total time               : 0.008 s
0.19/0.48	# Maximum resident set size: 1788 pages
0.19/0.48	
0.19/0.48	# -------------------------------------------------
0.19/0.48	# User time                : 0.005 s
0.19/0.48	# System time              : 0.006 s
0.19/0.48	# Total time               : 0.011 s
0.19/0.48	# Maximum resident set size: 1712 pages
0.19/0.48	EOF